K-independence Critical Graphs
نویسندگان
چکیده
Let k be a positive integer and G = (V (G), E(G)) a graph. A subset S of V (G) is a k-independent set of G if the subgraph induced by the vertices of S has maximum degree at most k − 1. The maximum cardinality of a k-independent set of G is the k-independence number βk(G). In this paper, we study the properties of graphs for which the k-independence number changes whenever an edge or vertex is removed or an edge is added.
منابع مشابه
Independence Complexes of Stable Kneser Graphs
For integers n ≥ 1, k ≥ 0, the stable Kneser graph SGn,k (also called the Schrijver graph) has as vertex set the stable n-subsets of [2n + k] and as edges disjoint pairs of n-subsets, where a stable n-subset is one that does not contain any 2-subset of the form {i, i + 1} or {1, 2n + k}. The stable Kneser graphs have been an interesting object of study since the late 1970’s when A. Schrijver de...
متن کاملEquimatchable Graphs on Surfaces
A graph G is equimatchable if any matching of G is a subset of a maximum-size matching. From a general description of equimatchable graphs in terms of GallaiEdmonds decomposition [Lesk, Plummer, and Pulleyblank, "Equimatchable graphs", Graphs Theory and Combinatorics, Academic press, London, (1984) 239-254.] it follows that any 2-connected equimatchable graph is either bipartite or factor-criti...
متن کاملApproximating Vizing's independence number conjecture
In 1965, Vizing conjectured that the independence ratio of edge-chromatic critical graphs is at most 1 2 . We prove that for every > 0 this conjecture is equivalent to its restriction on a specific set of edge-chromatic critical graphs with independence ratio smaller than 1 2 + .
متن کاملThe critical independence number and an independence decomposition
An independent set Ic is a critical independent set if |Ic|−|N(Ic)| ≥ |J | − |N(J)|, for any independent set J . The critical independence number of a graph is the cardinality of a maximum critical independent set. This number is a lower bound for the independence number and can be computed in polynomial-time. Any graph can be decomposed into two subgraphs where the independence number of one s...
متن کاملThe Ultimate Categorical Independence Ratio of Complete Multipartite Graphs
The independence ratio i(G) of a graph G is the ratio of its independence number and the number of vertices. The ultimate categorical independence ratio of a graph G is defined as limk→∞ i(G×k), where G×k denotes the kth categorical power of G. This parameter was introduced by Brown, Nowakowski and Rall, who asked about its value for complete multipartite graphs. In this paper we determine the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 53 شماره
صفحات -
تاریخ انتشار 2012